Network-based hierarchical population structure analysis for large genomic data sets
نویسندگان
چکیده
منابع مشابه
Analysis of Hierarchical Bayesian Models for Large Space Time Data of the Housing Prices in Tehran
Housing price data is correlated to their location in different neighborhoods and their correlation is type of spatial (location). The price of housing is varius in different months, so they also have a time correlation. Spatio-temporal models are used to analyze this type of the data. An important purpose of reviewing this type of the data is to fit a suitable model for the spatial-temporal an...
متن کاملHierarchical exploration of large multivariate data sets
Multivariate data visualization techniques are often limited in terms of the number of data records that can be simultaneously displayed in a manner that allows ready interpretation. Due to the size of the screen and number of pixels available, visualizing more than a few thousand data points generally leads to clutter and occlusion. This in turn restricts our ability to detect, classify, and m...
متن کاملAnalysis Issues for Large Cmb Data Sets
Multi-frequency, high resolution, full sky measurements of the anisotropy in both temperature and polarisation of the cosmic microwave background radiation are the goals of the satellite missions MAP (NASA) and Planck (ESA). The ultimate data products of these missions — multiple microwave sky maps, each of which will have to comprise more than ∼ 106 pixels in order to render the angular resolu...
متن کاملFast algorithms for nonparametric population modeling of large data sets
Population models are widely applied in biomedical data analysis since they characterize both the average and individual responses of a population of subjects. In absence of a reliable mechanistic model, one can resort to the Bayesian nonparametric approach that models the individual curves as Gaussian processes. This paper develops an efficient computational scheme for estimating the average a...
متن کاملA parallel algorithm for Bayesian network structure learning from large data sets
This paper considers a parallel algorithm for Bayesian network structure learning from large data sets. The parallel algorithm is a variant of the well known PC algorithm. The PC algorithm is a constraint-based algorithm consisting of five steps where the first step is to perform a set of (conditional) independence tests while the remaining four steps relate to identifying the structure of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genome Research
سال: 2019
ISSN: 1088-9051,1549-5469
DOI: 10.1101/gr.250092.119